Finite-Resolution Simplicial Complexes

نویسندگان

  • Werner Hölbling
  • Werner Kuhn
  • Andrew U. Frank
چکیده

Simplicial Complexes are used to model topology in Geographic Information Systems (GIS). Line intersection is an essential operation to update them. We introduce a finite-resolution line intersection method, called Zero Order Intersection, and apply it to simplicial complexes. Any reliable implementation of a line intersection algorithm has to address the limitations of a discrete computational environment. If handled improperly, finite representation can cause drifting lines and similar effects in otherwise topologically consistent data. The Zero Order Intersection method is designed to avoid such inconsistencies. Its application to simplicial complexes results in the Discrete Simplicial Data Model which guarantees consistency and reliability of topological queries within a GIS.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a special class of Stanley-Reisner ideals

For an $n$-gon with vertices at points $1,2,cdots,n$, the Betti numbers of its suspension, the simplicial complex that involves two more vertices $n+1$ and $n+2$, is known. In this paper, with a constructive and simple proof, wegeneralize this result to find the minimal free resolution and Betti numbers of the $S$-module $S/I$ where  $S=K[x_{1},cdots, x_{n}]$ and $I$ is the associated ideal to ...

متن کامل

Vertex Decomposable Simplicial Complexes Associated to Path Graphs

Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...

متن کامل

Cohen-Macaulay-ness in codimension for simplicial complexes and expansion functor

In this paper we show that expansion of a Buchsbaum simplicial complex is $CM_t$, for an optimal integer $tgeq 1$. Also, by imposing extra assumptions on a $CM_t$ simplicial complex, we provethat it can be obtained from a Buchsbaum complex.

متن کامل

New methods for constructing shellable simplicial complexes

A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • GeoInformatica

دوره 2  شماره 

صفحات  -

تاریخ انتشار 1998